Stochastic Analysis of the k-Server Problem on the Circle
نویسندگان
چکیده
Department of Informatics and System Sciences, Sapienza University of Rome, [email protected] Lab. de Mathématiques et Applications, Univ. de Poitiers, [email protected] Université de Lyon, Institut Camille Jordan, [email protected] Department of Informatics, Athens University of Economics & Business, [email protected] Computer Science Department, Brown University, [email protected]
منابع مشابه
Network Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملApplied Probability Trust (9 May 2010) PROBABILISTIC ANALYSIS OF THE K-SERVER PROBLEM ON THE CIRCLE
We consider a stochastic version of the k-server problem, in which k servers move on a circle to satisfy randomly generated requests. The requests are independent and identically distributed, according to an arbitrary distribution that is either discrete or continuous. The cost of serving a request is the distance that a server needs to travel in order to reach the request. The goal is to minim...
متن کاملStochastic k-Server: How Should Uber Work?
In this paper we study a stochastic variant of the celebrated k-server problem. In the kserver problem, we are required to minimize the total movement of k servers that are serving an online sequence of t requests in a metric. In the stochastic setting we are given t independent distributions 〈P1, P2, . . . , Pt〉 in advance, and at every time step i a request is drawn from Pi. Designing the opt...
متن کاملProbabilistic Analysis of the K-server Problem on the Circle
We consider a stochastic version of the k-server problem, in which k servers move on a circle to satisfy randomly generated requests. The requests are independent and identically distributed, according to an arbitrary distribution that is either discrete or continuous. The cost of serving a request is the distance that a server needs to travel in order to reach the request. The goal is to minim...
متن کامل